-
1 recursively presented group
Математика: рекурсивно определённая группаУниверсальный англо-русский словарь > recursively presented group
-
2 recursively presented group
English-Russian scientific dictionary > recursively presented group
-
3 recursively
1) рекурсно
2) рекурсивно
3) рекуррентно ∙ completely recursively enumerable class ≈ вполне рекурсивно перечислимый класс general recursively inequal numbers ≈ общерекурсивно неравные числа general recursively irrational number ≈ общерекурсивно иррациональное число general recursively true ≈ общерекурсивно истинный general recursively true formula ≈ общерекурсивно истинная формула primitive recursively true ≈ примитивно-рекурсивно истинный recursively approximable set ≈ рекурсивно аппроксимируемое множество recursively axiomatizable theor ≈ рекурсивно аксиоматизируемая теория recursively axiomatized theor ≈ рекурсивно аксиоматизированная теория recursively bounded quantifier ≈ рекурсивно ограниченный квантор recursively calculable function ≈ рекурсивно вычислимая функция recursively complex number ≈ рекурсивно комплексное число recursively continuous function ≈ рекурсивно непрерывная функция recursively convergent function ≈ рекурсивно сходящаяся функция recursively convergent sequence ≈ рекурсивно сходящаяся последовательность recursively creative set ≈ рекурсивно креативное множество recursively defined function ≈ рекуррентно определенная функция recursively defined sequence ≈ рекурсивно определенная последовательность recursively differentiable function ≈ рекурсивно дифференцируемая функция recursively divergent function ≈ рекурсивно расходящаяся функция recursively divergent sequence ≈ рекурсивно расходящаяся последовательность recursively enumerable cylinder ≈ рекурсивно перечислимый цилиндр recursively enumerable degree ≈ рекурсивно перечислимая степень recursively enumerable index ≈ рекурсивно перечислимый индекс recursively enumerable ordinal ≈ рекурсивно перечислимое порядковое число recursively enumerable predicate ≈ рекурсивно перечислимый предикат recursively enumerable problem ≈ рекурсивно перечислимая проблема recursively enumerable relation ≈ рекурсивно перечислимое отношение recursively enumerable sequence ≈ рекурсивно перечислимая последовательность recursively enumerable set ≈ рекурсивное перечислимое множество recursively enumerable structure ≈ рекурсивно перечислимая структура recursively enumerable subclass ≈ рекурсивно перечислимый подкласс recursively enumerable subset ≈ рекурсивно перечислимое подмножество recursively enumerable theor ≈ рекурсивно перечислимая теория recursively equivalent sets ≈ рекурсивно эквивалентные множества recursively extensible function ≈ рекурсивно продолжаемая функция recursively incompletable theor ≈ рекурсивно непополнимая теория recursively indecomposable set ≈ рекурсивно неразложимое множество recursively inseparable sets ≈ рекурсивно неотделимые множества recursively invariant concept ≈ рекурсивно инвариантное понятие recursively invariant relation ≈ рекурсивно инвариантное отношение recursively isomorphic set ≈ рекурсивно изоморфное множество recursively presentable structure ≈ рекурсивно представимая структура recursively presented group ≈ рекурсивно определенная группа recursively productive set ≈ рекурсивно продуктивное множество recursively real number ≈ рекурсивно вещественное число recursively related system of notation ≈ рекурсивная по упорядочению система обозначений recursively representable operation ≈ рекурсивно представимая операция recursively representable relation ≈ рекурсивно представимое отношение recursively separable sets ≈ рекурсивно отделимые множества recursively solvable problem ≈ рекурсивно разрешимая проблема recursively undecidable theor ≈ рекурсивно неразрешимая теория recursively unequal numbers ≈ рекурсивно неравные числа - recursively axiomatized - recursively calculable - recursively closed - recursively computable - recursively conditional - recursively continuous - recursively convergent - recursively differentiable - recursively divergent - recursively enumerable - recursively equivalent - recursively expressible - recursively extensible - recursively inseparable - recursively isomorphic - recursively isotonic - recursively presentable - recursively projective - recursively realizable - recursively representable - recursively soluble - recursively true - recursively unsolvable РекурсивноБольшой англо-русский и русско-английский словарь > recursively
-
4 group
1) группа, ансамбль || групповой- roughing mill group2) совокупность; комплект3) группировка || группировать(ся)5) класс; категория || классифицировать; категоризировать6) хим. остаток7) сгусток; скопление8) узел9) матем. группа- absolute free group - absolute homotopy group - absolutely irreducible group - absolutely simple group - additively written group - adele group - adelic group - algebraically compact group - algebraically simple group - almost connected group - almost cyclic group - almost ordered group - almost periodic group - almost simple group - alternating form group - cancellative group - cellular homology group - characteristically simple group - complementing group - completely anisotropic group - completely discontinuous group - completely divisible group - completely indecomposable group - completely integrally closed group - deficient group - direct homology group - direct indecomposable group - doubly transitive group - finitely defined group - finitely generated group - finitely presented group - finitely related group - first homology group - first homotopy group - freely generated group - full linear group - full orthogonal group - full rotation group - full symmetric group - full unimodular group - group of classes of algebras - group of covering transformations - group of finite rank - group of infinite order - group of infinite rank - group of inner automorphisms - group of linear equivalence - group of linear forms - group of linear manifold - group of principal ideles - group of real line - group of recursive permutations - group of right quotients - idele class group - linearly ordered group - linearly transitive group - locally bicompact group - locally closed group - locally compact group - locally connected group - locally cyclic group - locally defined group - locally embeddable group - locally finite group - locally free group - locally infinite group - locally nilpotent group - locally normal group - locally solvable group - multiply primitive group - multiply transitive group - nonsolvable group - n-th homotopy group - ordered pair group - principal congruence group - properly orthogonal group - properly unimodular group - pure projective group - pure rotation group - pure simple group - quasipure projective group - quotient divisible group - residually nilpotent group - restricted holonomy group - sharply transitive group - simply ordered group - simply reducible group - simply transitive group - singular cogomology group - singular homology group - solvable group - stable group - strictly transitive group - strongly polycyclic group - subsolvable group - supersolvable group - totally ordered group - totally projective group - totally reducible group - triply transitive group - unitary symmetry group - unitary transformation group - value group - weak homology group - weakly mixing groupgroup with multiple operators — группа с многоместными операторами, мультиоператорная группа
См. также в других словарях:
Presentation of a group — In mathematics, one method of defining a group is by a presentation. One specifies a set S of generators so that every element of the group can be written as a product of some of these generators, and a set R of relations among those generators.… … Wikipedia
Rank of a group — For the dimension of the Cartan subgroup, see Rank of a Lie group In the mathematical subject of group theory, the rank of a group G , denoted rank( G ), can refer to the smallest cardinality of a generating set for G , that is:… … Wikipedia
Algebraically closed group — In mathematics, in the realm of group theory, a group A is algebraically closed if any finite set of equations and inequations that make sense in A already have a solution in A . This idea will be made precise later in the article.Informal… … Wikipedia
Absolute presentation of a group — In mathematics, one method of defining a group is by an absolute presentation.B. Neumann, The isomorphism problem for algebraically closed groups, in: Word Problems, Decision Problems, and the Burnside Problem in Group Theory, Amsterdam London… … Wikipedia
Grigorchuk group — In the mathematical area of group theory, the Grigorchuk group or the first Grigorchuk group is a finitely generated group constructed by Rostislav Grigorchuk that provided the first example of a finitely generated group of intermediate (that is … Wikipedia
Word problem for groups — In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a recursively presented group G is the algorithmic problem of deciding whether two words represent the same element. Although it… … Wikipedia
Higman's embedding theorem — In group theory, Higman s embedding theorem states that every finitely generated recursively presented group R can be embedded as a subgroup of some finitely presented group G . This is a result of Graham Higman from the 1960s. [ Graham Higman,… … Wikipedia
HNN extension — In mathematics, the HNN extension is a basic construction of combinatorial group theory.Introduced in a 1949 paper Embedding Theorems for Groups [ cite journal|title=Embedding Theorems for Groups|journal=Jornal of the London Mathematical… … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Undecidable problem — In computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is impossible to construct an algorithm that leads to a yes or no answer the problem is not decidable.A decision problem is any … Wikipedia